Evolutionary Neural Networks for Value Ordering in Constraint Satisfaction Problems
نویسندگان
چکیده
A new method for developing good value-ordering strategies in constraint satisfaction search is presented. Using an evolutionary technique called SANE, in which individual neurons evolve to cooperate and form a neural network, problem-speci c knowledge can be discovered that results in better value-ordering decisions than those based on problem-general heuristics. A neural network was evolved in a chronological backtrack search to decide the ordering of cars in a resource-limited assembly line. The network required 1/30 of the backtracks of random ordering and 1/3 of the backtracks of the maximization of future options heuristic. The SANE approach should extend well to other domains where heuristic information is either di cult to discover or problem-speci c.
منابع مشابه
Neural Networks to Guide the Selection of Heuristics within Constraint Satisfaction Problems
Hyper-heuristics are methodologies used to choose from a set of heuristics and decide which one to apply given some properties of the current instance. When solving a Constraint Satisfaction Problem, the order in which the variables are selected to be instantiated has implications in the complexity of the search. We propose a neural network hyper-heuristic approach for variable ordering within ...
متن کاملLook-Ahead Value Ordering for Constraint Satisfaction Problems
Looking ahead during search is often useful when solving constraint satisfaction problems. Previous studies have shown that looking ahead helps by causing dead-ends to occur earlier in the search, and by providing information that is useful for dynamic variable ordering. In this paper, we show that another bene t of looking ahead is a useful domain value ordering heuristic, which we call look-a...
متن کاملAn E cient Heuristic-Based Evolutionary Algorithm for Solving Constraint Satisfaction Problems
GENET and EGENET are local search algorithms based on artiicial neural networks which have proved very successful in solving hard constraint satisfaction problems (CSPs). In this paper we describe a micro-genetic algorithm for solving CSPs which generalizes the (E)GENET approach. It is based on min-connict local search together with two methods for escaping local minima: population based learni...
متن کاملImproving Genet and Egenet by New Variable Ordering Strategies
Constraint satisfaction problems (CSPs) naturally occur in a number of important industrial applications such as planning and scheduling defeating many algorithmic search methods. GENET and it extended model, EGENET, are probabilistic neural networks which had some remarkable success in solving some hard instances of CSPs such as a set of hard graph coloring problems. Both GENET or EGENET does ...
متن کاملFrequency Assignment for Cellular Mobile Systems Using Constraint Satisfaction Techniques
This paper presents a new algorithm for solving frequency assignment problems in cellular mobile systems using constraint satisfaction techniques. The characteristics of this algorithm are as follows: 1) instead of representing each call in a cell (a unit area in providing communication services) as a variable, we represent a cell (which has multiple calls) as a variable that has a very large d...
متن کامل